Some issues related to double roundings
نویسندگان
چکیده
Double rounding is a phenomenon that may occur when different floatingpoint precisions are available on the same system. Although double rounding is, in general, innocuous, it may change the behavior of some useful small floating-point algorithms. We analyze the potential influence of double rounding on the Fast2Sum and 2Sum algorithms, on some summation algorithms, and Veltkamp’s splitting.
منابع مشابه
On Geometric Structure of Global Roundings for Graphs and Range Spaces
Given a hypergraph H = (V,F) and a [0, 1]-valued vector a ∈ [0, 1] , its global rounding is a binary (i.e.,{0, 1}-valued) vector α ∈ {0, 1} such that | ∑ v∈F (a(v)−α(v))| < 1 holds for each F ∈ F . We study geometric (or combinatorial) structure of the set of global roundings of a using the notion of compatible set with respect to the discrepancy distance. We conjecture that the set of global r...
متن کاملCombinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence
We discuss the problem of computing all the integer sequences obtained by rounding an input sequence of n real numbers such that the discrepancy between the input sequence and each output binary sequence is less than one. The problem arises in the design of digital halftoning methods in computer graphics. We show that the number of such roundings is at most n + 1 if we consider the discrepancy ...
متن کاملThe Structure and Number of Global Roundings of a Graph
Given a connected weighted graph G = (V,E), we consider a hypergraph HG = (V,PG) corresponding to the set of all shortest paths in G. For a given real assignment a on V satisfying 0 ≤ a(v) ≤ 1, a global rounding α with respect to HG is a binary assignment satisfying that |∑v∈F a(v) − α(v)| < 1 for every F ∈ PG. We conjecture that there are at most |V |+1 global roundings for HG, and also the se...
متن کاملCircles and Quadratic Maps Between Spheres
Consider an analytic map from a neighborhood of 0 in a vector space to a Euclidean space. Suppose that this map takes all germs of vector lines to germs of circles. Such map is called rounding. Two roundings are equivalent if they take the same lines to the same circles. We prove that any rounding whose differential at 0 has rank at least 2 is equivalent to a fractional quadratic rounding. The ...
متن کاملValidated Roundings of Dot Products by Sticky Accumulation
The dot product operation is very prevalent in scientific computation and has therefore been incorporated as a primitive operation in some languages. The implementation of the dot product operation by a sequence of IEEE standard multiplications and additions does not prevent a substantial accumulation of the round-off errors or warn the user about a catastrophic cancellation. We present the des...
متن کامل